Improved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling
نویسندگان
چکیده
منابع مشابه
Improved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling
The earliest-pseudo-deadline-first (EPDF) Pfair algorithm is more efficient than other known Pfair schedulingalgorithms, but is not optimal for scheduling recurrent real-time task systems on more than two identical pro-cessors. Although not optimal, EPDF may be preferable for real-time systems instantiated on less-powerfulplatforms, those with soft timing constraints, or those whose...
متن کاملA Schedulable Utilization Bound for the Multiprocessor EPDF Pfair Algorithm
The earliest-pseudo-deadline-first (EPDF) Pfair scheduling algorithm is less expensive than some other knownPfair algorithms, but is not optimal for scheduling recurrent real-time tasks on more than two processors. In priorwork, sufficient per-task weight (i.e., utilization) restrictions were established for ensuring that tasks either donot miss their deadlines or have bounded tardi...
متن کاملInterval-valued fuzzy permutation method and experimental analysis on cardinal and ordinal evaluations
371 Interval-valued fuzzy permutation method and experimental analysis on cardinal and ordinal evaluations Ting-Yu Chen and Jih-Chang Wang 388 Improved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling UmaMaheswari C. Devi and James H. Anderson Erratum 421 Erratum to “Languages not recognizable in real time by one-dimensional cellular automata” [J. Comput. System Sci. ...
متن کاملSchedulable Utilization Bounds for EPDF Fair Multiprocessor Scheduling
The earliest-pseudo-deadline-first (EPDF) algorithm is less expensive than other known Pfair algorithms, but is not optimal for scheduling recurrent real-time tasks on more than two processors. Prior work established sufficient per-task weight (i.e., utilization) restrictions that ensure that tasks either do not miss their deadlines or have bounded tardiness when scheduled under EPDF. Implicit ...
متن کاملTardiness Bounds under Global EDF Scheduling on a Multiprocessor
This is the review of two papers, Tardiness Bounds under Global EDF Scheduling on a Multiprocessor (RTSS’05) and An O(m) Analysis Technique for Supporting Real-Time Self-Suspending Task Systems (RTSS’12).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2009
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2009.03.003